k-Link Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane
نویسندگان
چکیده
We present an algorithm for computing k-link rectilinear shortest paths among rectilinear obstacles in the plane. We extend the “continuous Dijkstra” paradigm to store the link distance information associated with each propagating “wavefront”. Our algorithm runs in time O(kn log n) and space O(kn), where n is the number of vertices of the obstacles. Previous algorithms for the problem had worst-case time complexity O(kn). Our algorithm builds a j-link shortest path map, rooted at a given source s, for each j ≤ k. A shortest path query from s to a query point t can then be answered in time O(log n + j).
منابع مشابه
Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane
Given a rectilinear domain P of h pairwise-disjoint rectilinear obstacles with a total of n vertices in the plane, we study the problem of computing bicriteria rectilinear shortest paths between two points s and t in P. Three types of bicriteria rectilinear paths are considered: minimum-link shortest paths, shortest minimum-link paths, and minimum-cost paths where the cost of a path is a non-de...
متن کاملAn Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
We consider the problem of finding minimum-link rectilinear paths in rectilinear polygonal domains in the plane. A path or a polygon is rectilinear if all its edges are axis-parallel. Given a set P of h pairwise-disjoint rectilinear polygonal obstacles with a total of n vertices in the plane, a minimumlink rectilinear path between two points is a rectilinear path that avoids all obstacles with ...
متن کاملFinding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model
Finding the best rectilinear path with respect to the bends and the lengths of paths connecting two given points in the presence of rectilinear obstacles in a two-layer model is studied in this paper. In this model, rectilinear obstacles on each layer are speciied separately, and the orientation of routing in each layer is xed. An algorithm is presented to transform any problem instance in the ...
متن کاملRectilinear Path Problems among Rectilinear Obstacles Revisited
We present eecient algorithms for nding rectilinear collision-free paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for nding the shortest rectilinear path, the minimum-bend shortest rectilinear path, the shortest minimum-bend rectilinear path and the minimum-cost rectilinear path. For nding the shortest rectilinear...
متن کاملFinding Shortest Non-Crossing Rectilinear Paths in Plane Regions
A b s t r a c t . Let A be a plane region which is bounded by an outer rectangle and an inner one and has r rectangular obstacles inside the region. Let k terminal pairs lie on the outer and inner rectangular boundaries. This paper presents an efficient algorithm which finds k "non-crossing" rectilinear paths in the plane region A, each connecting a terminal pair without passing through any obs...
متن کامل